Using Higher-Order Logic Programming for Semantic Interpretation of Coordinate Constructs
نویسنده
چکیده
Many theories of semantic interpretation use λ-term manipulation to compositionally compute the meaning of a sentence. These theories are usually implemented in a language such as Prolog that can simulate λ-term operations with first-order unification. However, for some interesting cases, such as a Combinatory Categorial Grammar account of coordination constructs, this can only be done by obscuring the underlying linguistic theory with the “tricks” needed for implementation. This paper shows how the use of abstract syntax permitted by higher-order logic programming allows an elegant implementation of the semantics of Combinatory Categorial Grammar, including its handling of coordination constructs.
منابع مشابه
Relational Programming in Libra
Libra is a general-purpose programming language based on the algebra of binary relations. It attempts to unify functional and logic programming, retaining the advantages of both, and avoiding some of the problems. It has all the features needed of a programming language, and a straightforward semantic interpretation. Since program speciications are easily expressed as relations, it ooers a simp...
متن کاملProgramming with Dynamic Predicate Logic
We propose to bring together two research traditions, computation with first order logic from computer science, and dynamic interpretation of first order logic from natural language semantics. We define a new executable process interpretation for first order logic, and show that it is a faithful approximation of the dynamic interpretation procedure for first order formulas. We then demonstrate ...
متن کاملModelling Generic Judgements
We propose a semantics for the ∇-quantifier of Miller and Tiu. First we consider the case for classical first-order logic. In this case, the interpretation is close to standard Tarski-semantics and completeness can be shown using a standard argument. Then we put our semantics into a broader context by giving a general interpretation of ∇ in categories with binding structure. Since categories wi...
متن کاملTopological Models for Higher Order Control Flow
Semantic models are presented for two simple imperative languages with higher order constructs. In the rst language the interesting notion is that of second order assignment x := s, for x a procedure variable and s a statement. The second language extends this idea by a form of higher order communication, with statements c ! s and c ? x, for c a channel. We develop operational and denotational ...
متن کاملMinimum Model Semantics for Extensional Higher-order Logic Programming with Negation
Extensional higher-order logic programming has been introduced as a generalization of classical logic programming. An important characteristic of this paradigm is that it preserves all the well-known properties of traditional logic programming. In this paper we consider the semantics of negation in the context of the new paradigm. Using some recent results from non-monotonic fixed-point theory,...
متن کامل